منابع مشابه
An efficient algorithm to recognize locally equivalent graphs
There are local operators on (labeled) graphs G with labels (gij) in a finite field. If the field is binary, the operations are just the local complementations, but in the general case, there are two different types of operators. For the first type, let v be a vertex of the graph and a ∈ Fq, and we obtain a graph with labels g ′ ij = gij+agvigvj . For the second type of operators, let 0 6= b ∈ ...
متن کاملLocally ̂ - Equivalent Algebras ^ )
Let A be a Banach "-algebra. A is locally ¿"-equivalent if, for every selfadjoint element t e A, the closed *-subalgebra of A generated by / is *-isomorphic to a ¿"-algebra. In this paper it is shown that when A is locally ¿"-equivalent, and in addition every selfadjoint element in A has at most countable spectrum, then A is *-isomorphic to a ¿"-algebra.
متن کاملRecognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(nm)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this...
متن کاملRecognizing Berge Graphs
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|). This is independent of the recent proof of the strong perfect graph conjecture.
متن کاملRecognizing k-path Graphs
The k-path graph Pk(H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or cycle of length k + 1 in H , and if the common edges of both paths form a path of length k − 1. In this paper we give a (nonpolynomial) recognition algorithm for k-path graphs, for every integer k¿2. The algorithm runs in polynomial time if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90357-y